A Survey of Satisfiability Modulo Theory

Satisfiability modulo theory (SMT) consists in testing the satisfiability of first-order formulas over linear integer or real arithmetic, or other theories. In this survey, we explain the combination of propositional satisfiability and decision procedures for conjunctions known as DPLL(T), and the alternative "natural domain" approaches. We also cover quantifiers, Craig interpolants, polynomial arithmetic, and how SMT solvers are used in automated software analysis.Comment: Computer Algebra in Scientific Computing, Sep 2016, Bucharest, Romania. 201

A stochastic particle method with random weights for the computation of statistical solutions of McKean-Vlasov equations Part I : foundation of the method and empirical evidence

Theme 4 - Simulation et optimisation de systemes complexes - Projet OmegaSIGLEAvailable from INIST (FR), Document Supply Service, under shelf-number : 14802 E, issue : a.2001 / INIST-CNRS - Institut de l'Information Scientifique et TechniqueFRFranc

Symbolic Recipes for Real Solutions

Contribution à un ouvrage.International audienceThe main purpose of this chapter is to show how to use algorithms and methodology provided by computer algebra to manipulate in a symbolic way the real solutions of an algebraic system of equations